Learning Mixed Membership Mallows Models from Pairwise Comparisons
نویسندگان
چکیده
We propose a novel parameterized family of Mixed Membership Mallows Models (M4) to account for variability in pairwise comparisons generated by a heterogeneous population of noisy and inconsistent users. M4 models individual preferences as a user-specific probabilistic mixture of shared latent Mallows components. Our key algorithmic insight for estimation is to establish a statistical connection between M4 and topic models by viewing pairwise comparisons as words, and users as documents. This key insight leads us to explore Mallows components with a separable structure and leverage recent advances in separable topic discovery. While separability appears to be overly restrictive, we nevertheless show that it is an inevitable outcome of a relatively small number of latent Mallows components in a world of large number of items. We then develop an algorithm based on robust extreme-point identification of convex polygons to learn the reference rankings, and is provably consistent with polynomial sample complexity guarantees. We demonstrate that our new model is empirically competitive with the current state-of-the-art approaches in predicting real-world preferences.
منابع مشابه
Learning Mallows Models with Pairwise Preferences
Learning preference distributions is a key problem in many areas (e.g., recommender systems, IR, social choice). However, many existing methods require restrictive data models for evidence about user preferences. We relax these restrictions by considering as data arbitrary pairwise comparisons—the fundamental building blocks of ordinal rankings. We develop the first algorithms for learning Mall...
متن کاملEffective sampling and learning for mallows models with pairwise-preference data
Learning preference distributions is a critical problem in many areas (e.g., recommender systems, IR, social choice). However, many existing learning and inference methods impose restrictive assumptions on the form of user preferences that can be admitted as evidence. We relax these restrictions by considering as data arbitrary pairwise comparisons of alternatives, which represent the fundament...
متن کاملA Probabilistic Graphical Model for Mallows Preferences
Reasoning about preference distributions is an important task in various areas (e.g., recommender systems, social choice), and is critical for learning the parameters of the distribution. We consider the Mallows model with arbitrary pairwise comparisons as evidence. Existing inference methods are able to reason only with evidence that abides to a restrictive form. We establish the conditional i...
متن کاملRecommendation from Intransitive Pairwise Comparisons
In this paper we propose a full Bayesian probabilistic method to learn preferences from non-transitive pairwise comparison data. Such lack of transitivity easily arises when the number of pairwise comparisons is large, and they are given sequentially without allowing for consistency check. We develop a Bayesian Mallows model able to handle such data through a latent layer of uncertainty which c...
متن کاملMarkov Chain Choice Model from Pairwise Comparisons
Recently, the Markov chain choice model has been introduced by Blanchet et al. to overcome the computational intractability for learning and revenue management for several modern choice models, including the mixed multinomial logit models. However, the known methods for learning the Markov models require almost all items to be offered in the learning stage, which is impractical. To address this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1504.00757 شماره
صفحات -
تاریخ انتشار 2015